On the connections between dual-tree methods and shortest path problems
نویسنده
چکیده
This paper reports on my exploration of the connections between the family of algorithms collectively known as the dual-tree approach, and the family of shortest-path problems in graphs. I explain why we might expect connections to exist, and the difficulties I encountered in applying the dual-tree method to shortest-path problems.
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کاملGeometric Data Structures and Their Selected Applications
Finding the shortest path between two positions is a fundamental problem in transportation, routing, and communications applications. In robot motion planning, the robot should pass around the obstacles touching none of them, i.e. the goal is to find a collision-free path from a starting to a target position. This task has many specific formulations depending on the shape of obstacles, allowabl...
متن کاملDual algorithms for the shortest path tree problem
We consider dual approaches for the Shortest Path Tree problem. After a brief introduction to the problem, we review the most important dual algorithms which have been described in the literature for its solution, and propose a new family of dual ascent algorithms. In these algorithms, “local” and “global” dual updating operations are performed at the nodes in order to enlarge a partial shortes...
متن کاملAn Efficient Multi Path Dynamic Routing Protocol for Computing and Constrained Mobile Ad-hoc Network Environment
Wireless mobile ad-hoc networks are classified as ad-hoc networks with logical connections. These types of networks do not have fixed topology (or physical connections) due to the mobility property of nodes, interference, propagation and loss of path. Because of all these problems the path established between sources to destination is not reliable and efficient path. Hence a dynamic source rout...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006